Algorithms for weighted graph problems on the modified cellular graph automaton
نویسندگان
چکیده
منابع مشابه
Randomized Algorithms for Graph Problems
Randomization is a powerful tool in the design of algorithms. In this proposal we use randomness to make progress on several old and fundamental problems. We close the approximability of feedback arc set on tournament graphs, first studied around 1961 [16], by designing a PTAS. We give a practical algorithm with improved performance for finding strongly connected components in parallel (first s...
متن کاملWeighted graph algorithms with Python
Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are instances of the Edge class. Graphs are instances of the Graph class. It is based on the adjacency-list representation, but with fast lookup of nodes and neig...
متن کاملGraph Algorithms for Network Connectivity Problems
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.
متن کاملApproximation Algorithms for Graph Homomorphism Problems
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, find a mapping φ : VG 7→ VH that maximizes the number of edges of G that are mapped to edges of H. This problem encodes various fundamental NP-hard problems including Maxcut and Max-k-cut. We also consider the multiway uncut problem. We are given a graphG and a set of terminals T ⊆ VG. We want to p...
متن کاملEfficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph ofhorizontal and vertical line segments. We first extract several basic operations for depth first search and breadth first search on a graph. Then we present data structures for the intersection graph in terms of which those operations can be implemented in an efficient man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1989
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1989230302511